Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
نویسندگان
چکیده
منابع مشابه
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. This paper shows that for voters who follow the most central political-science model of electorates— single-peaked preferences—those hardness protections vanish. By using single-peaked preferences to simplify combinatorial coverin...
متن کاملReinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates
Understanding when and how computational complexity can be used to protect elections against different manipulative actions has been a highly active research area over the past two decades. A recent body of work, however, has shown that many of the NP-hardness shields, previously obtained, vanish when the electorate has single-peaked or nearly single-peaked preferences. In light of these result...
متن کاملComputational Aspects of Nearly Single-Peaked Electorates
Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting systems are, in the general case, computationally resistant to some of these manipulative actions. However when restricted to single-peaked electorates, these systems suddenly become easy to manipulate. Recently, Faliszewski, Hemaspaandra, and Hemaspaandra (2011b) studied the complexity ...
متن کاملIncomplete Preferences in Single-Peaked Electorates
Incomplete preferences are likely to arise in realworld preference aggregation and voting systems. This paper deals with determining whether an incomplete preference profile is single-peaked. This is essential information since many intractable voting problems become tractable for single-peaked profiles. We prove that for incomplete profiles the problem of determining single-peakedness is NPcom...
متن کاملThe Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract)
Many electoral control and manipulation problems—which we will refer to in general as “manipulative actions” problems—are NP-hard in the general case. Many of these problems fall into polynomial time if the electorate is singlepeaked, i.e., is polarized along some axis/issue. However, real-world electorates are not truly single-peaked—for example, there may be some maverick voters—and to take t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2015
ISSN: 1076-9757
DOI: 10.1613/jair.4647